SESAME - A System for Specifying Semantics in Abstract Argumentation
نویسندگان
چکیده
This is a report on an implemented system that allows the user to specify an argumentation semantics and that returns a logical encoding in the form of a parameterized propositional formula. When applied to a subset S of a given argumentation graph G, the instantiated formula is satisfiable if and only if S is an extension for G according to the argumentation semantics specified by the user.
منابع مشابه
Verifiability of Argumentation Semantics
Dung’s abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning is done via semantics extracting acceptable sets. All reasonable semantics are based on the notion of conflict-freeness which means that arguments are only j...
متن کاملOn the Difference between Assumption-based Argumentation and Abstract Argumentation
In the current paper, we re-examine the connection between abstract argumentation and assumption-based argumentation. These two formalisms are often claimed to be equivalent in the sense that (a) evaluating an assumption based argumentation framework directly with the dedicated semantics, and (b) first constructing the corresponding abstract argumentation framework and then applying the corresp...
متن کاملArgTools: a backtracking-based solver for abstract argumentation
We present ArgTools, a system for reasoning with abstract argumentation frameworks. The system solves a number of argumentation problems under preferred, stable, complete and grounded semantics. ArgTools is a C++ implementation of a backtracking algorithm.
متن کاملPerfection in Abstract Argumentation1
It is a well-known fact that stable semantics might not provide any extensions for some given abstract argumentation framework. Arguably such frameworks might be considered futile, at least with respect to stable semantics. We propagate σ -perfection stating that for a given argumentation graph all induced subgraphs provide σ -extensions. We discuss perfection and conditions for popular abstrac...
متن کاملComputational Aspects of Abstract Argumentation
This work is in the context of formal argumentation, a sub-field of Artificial Intelligence. Probably the most popular formalism in argumentation is abstract argumentation as introduced by Dung [42]. So called abstract argumentation frameworks abstract from the actual content of arguments and represent them as abstract entities and further abstract from the reasons of conflicts between argument...
متن کامل